Chapter 10 Bin Packing Here we consider the classical Bin Packing problem: We are given a set I = {1, . . . , n} of items, where item i ∈ I has size si ∈ (0, 1] and a set B = {1, . . . , n} of bins with capacity one

Source URL: www2.informatik.hu-berlin.de

• Computational complexity theory
• Theory of computation
• Complexity classes
• Packing problems
• NP-complete problems
• Bin packing problem
• Approximation algorithms
• Polynomial-time approximation scheme
• Partition problem
• NP
• NC
• Time complexity

Relativizing Small Complexity Classes and their Theories Klaus Aehlig∗ Stephen Cook

Source URL: www.cs.toronto.edu

Downloaded from rsif.royalsocietypublishing.org on June 10, 2010 The evolvability of programmable hardware Karthik Raman and Andreas Wagner J. R. Soc. Interface published online 9 June 2010 doi: rsif

Source URL: www.ieu.uzh.ch

• Circuit complexity
• Semiconductor devices
• Evolutionary biology
• Genetics
• Complexity classes
• Digital electronics
• Integrated circuit
• Electronic circuit
• Robustness
• Circuit
• Logic gate
• NC

Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

Source URL: www.usenix.org

• Complexity classes
• Circuit complexity
• Computational complexity theory
• Zero-knowledge proof
• Non-interactive zero-knowledge proof
• SM-62 Snark
• XTR
• NC
• NP
• Proof of knowledge
• Computer
• ZK

Template-based circuit understanding Adri`a Gasc´on∗ , Pramod Subramanyan† , Bruno Dutertre∗ , Ashish Tiwari∗ Dejan Jovanovi´c∗ , Sharad Malik† ∗ SRI International , ,

Source URL: yices.csl.sri.com

• Computational complexity theory
• Theoretical computer science
• Theory of computation
• Logic in computer science
• Formal methods
• Boolean algebra
• Complexity classes
• Electronic design automation
• Satisfiability modulo theories
• True quantified Boolean formula
• FO
• NC

On the Computational Complexity of ReoptimizationScientific Work

Source URL: www.ite.ethz.ch

• Computational complexity theory
• Approximation algorithms
• NP-complete problems
• Complexity classes
• Theoretical computer science
• Travelling salesman problem
• APX
• Optimization problem
• Combinatorial optimization
• Genetic algorithm
• Heuristic
• Steiner tree problem

Baire Categories on Small Complexity Classes and Meager-Comeager Laws Philippe Moser Department of Computer Science, National University of Ireland, Maynooth Co. Kildare, Ireland.

Source URL: www.cs.nuim.ie

Private and Secure Public-Key Distance Bounding Application to NFC Payment — Short Paper Serge Vaudenay EPFL CH-1015 Lausanne, Switzerland http://lasec.epfl.ch

Source URL: fc15.ifca.ai

• Cryptography
• Computational complexity theory
• Distance-bounding protocol
• Public-key cryptography
• Complexity classes
• Proof of knowledge
• IP
• Challengeresponse authentication
• NP
• Digital signature
• Security parameter
• Negligible function

Why Philosophers Should Care About Computational Complexity Scott Aaronson∗ Abstract One might think that, once we know something is computable, how efficiently it can be computed is a practical question with little fu

Source URL: www.scottaaronson.com

• Computational complexity theory
• Theory of computation
• Complexity classes
• Mathematical optimization
• Structural complexity theory
• Models of computation
• P versus NP problem
• NP
• Reduction
• Time complexity
• Oracle machine
• Low

Controlling Extraction in Abstract Categorial Grammars Sylvain Pogodalla1 and Florent Pompigne2 1

Source URL: www.angl.hu-berlin.de

• Theoretical computer science
• Grammar frameworks
• Complexity classes
• Theory of computation
• Type theory
• Formal languages
• Mathematics
• Categorial grammar
• NP
• Lambda calculus
• Model theory